<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 5886 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 5886 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/orbitingfIea/index.html'> orbitingfIea </a> </td>
<td> <a href='/problem/1004a/index.html'> 1004a. 【模板题】高精度乘法2 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 8.317 ms </td>
<td style='font-size:13px'> 436 KB </td>
<td style='font-size:13px'> C++11 </td>
<td style='font-size:13px'> 7.01 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2018-09-06 09:57:52 </td>
<td style='font-size:13px'> 2019-01-19 13:24:13 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#include&lt;stdio.h&gt;
#include&lt;vector&gt;
using namespace std;

class Bignum{
private:
  vector&lt;int&gt;a;
  void clear(){a.resize(1);a[0]=0;}
  void set_(int n){
    if(clear(),n){			
      int t;a.clear();
      while(n)a.push_back(n-(t=n/10000)*10000),n=t;
    }
  }
  void set_(long long n){
    if(clear(),n){			
      long long t;a.clear();
      while(n)a.push_back(n-(t=n/10000)*10000),n=t;
    }
  }
  void clearzero(){
    int l=a.size();
    while(l&gt;1 &amp;&amp; a[l-1]==0)l--;
    a.resize(l);
  }
  void set_(char*st){
    char c;vector&lt;int&gt; s;a.clear();
    while(((c=*(st++))&lt;&#x27;0&#x27; || c&gt;&#x27;9&#x27;));s.push_back(c-&#x27;0&#x27;);
    while((c=*(st++))&gt;=&#x27;0&#x27;&amp;&amp;c&lt;=&#x27;9&#x27;)s.push_back(c-&#x27;0&#x27;);          
    int l=s.size();
    for (int i=l-1;i-3&gt;=0;i-=4)a.push_back(s[i]+s[i-1]*10+s[i-2]*100+s[i-3]*1000);
    if(l&amp;3){
      int tmp=0;
      for (int i=0;i&lt;(l&amp;3);i++)tmp=tmp*10+s[i];
      a.push_back(tmp);
    }
    clearzero();
  }
public:
  Bignum(){clear();}
  Bignum(int n){set_(n);}
  Bignum(long long n){set_(n);}
  Bignum(char*s){set_(s);}
  Bignum&amp; operator=(int a){set_(a);return *this;}
  Bignum&amp; operator=(long long a){set_(a);return *this;}
  Bignum&amp; operator=(char *s){set_(s);return *this;}
  int size()const{
    if(a.back()&gt;=1000)return a.size()&lt;&lt;2;
    else if(a.back()&gt;=100)return (a.size()&lt;&lt;2)-1;
    else if(a.back()&gt;=10)return (a.size()&lt;&lt;2)-2;
    else return (a.size()&lt;&lt;2)-3;
  }
  long long toint()const{
    long long ans=0;
    for (int i=int(a.size())-1;i&gt;=0;i--)ans=ans*10000+a[i];
    return ans;
  }
  int tostr(char *s)const{
    int tot=0;
    for (unsigned int i=0;i&lt;a.size();i++)
      if(i+1==a.size()){
        int x=a[i];
        while(x)s[tot++]=&#x27;0&#x27;+x%10,x/=10;
      }else{
        int x=a[i];
        for (int j=0;j&lt;4;j++)s[tot++]=&#x27;0&#x27;+x%10,x/=10;
      }
    if(tot==0)s[tot++]=&#x27;0&#x27;;
    for (int i=0,j=tot-1;i&lt;j;i++,j--)swap(s[i],s[j]);
    s[tot]=0;
    return tot;
  }
  int toarr(int *s)const{
    int tot=0;
    for (unsigned int i=0;i&lt;a.size();i++)
      if(i+1==a.size()){
        int x=a[i];
        while(x)s[tot++]=x%10,x/=10;
      }else{
        int x=a[i];
        for (int j=0;j&lt;4;j++)s[tot++]=x%10,x/=10;
      }
    if(tot==0)s[tot++]=0;
    return tot;
  }
  int comp(const Bignum&amp;x)const{
    if(a.size()&lt;x.a.size())return 1;
    if(a.size()&gt;x.a.size())return -1;
    for (int i=a.size()-1;i&gt;=0;i--)
      if(a[i]&lt;x.a[i])return 1;
      else if(a[i]&gt;x.a[i])return -1;
    return 0;
  }
  bool operator&lt;(const Bignum&amp;x)const{return comp(x)==1;}
  bool operator&gt;(const Bignum&amp;x)const{return comp(x)==-1;}
  bool operator&lt;=(const Bignum&amp;x)const{return comp(x)!=-1;}
  bool operator&gt;=(const Bignum&amp;x)const{return comp(x)!=1;}
  bool operator!=(const Bignum&amp;x)const{return comp(x)!=0;}
  bool operator==(const Bignum&amp;x)const{return comp(x)==0;}	
  Bignum&amp; operator+=(const Bignum&amp;x){
    int l=max(a.size(),x.a.size())+1;
    a.resize(l);
    for (unsigned int i=0;i&lt;x.a.size();i++)a[i]+=x.a[i];
    for (int i=0;i&lt;l;i++)if(a[i]&gt;=10000)a[i]-=10000,a[i+1]++;
    clearzero();return *this;
  }
  Bignum&amp; operator-=(const Bignum&amp;x){
    for (unsigned int i=0;i&lt;x.a.size();i++)a[i]-=x.a[i];
    for (unsigned int i=0;i&lt;a.size();i++)if(a[i]&lt;0)a[i]+=10000,a[i+1]--;
    clearzero();return *this;
  }
  Bignum operator+(const Bignum&amp;x)const{Bignum y=*this;y+=x;return y;}		
  Bignum operator-(const Bignum&amp;x)const{Bignum y=*this;y-=x;return y;}		
  Bignum operator*(const Bignum&amp;x)const{
    int l=a.size()+x.a.size();
    Bignum z;z.a.clear();
    vector&lt;long long&gt;tmp;tmp.resize(l);
    for (unsigned int i=0;i&lt;x.a.size();i++)
      for (unsigned int j=0;j&lt;a.size();j++)
        tmp[i+j]+=x.a[i]*a[j];
    for (int i=0;i&lt;l;i++){
      long long t=tmp[i]/10000;
      z.a.push_back(int(tmp[i]-t*10000));
      t?tmp[i+1]+=t:0;
    }
    z.clearzero();return z;
  }
  Bignum operator*(long long x)const{
    if(x&gt;=10000)return *this * Bignum(x);
    int l=a.size()+2;
    Bignum z;z.a.resize(l);
    for (unsigned int i=0;i&lt;a.size();i++)z.a[i]=a[i]*x;
    for (int i=0,t;i&lt;l;i++)z.a[i+1]+=(t=z.a[i]/10000),z.a[i]-=t*10000;
    z.clearzero();return z;
  }
  friend Bignum operator*(long long x,const Bignum&amp;a){return a*x;}
  Bignum&amp; operator*=(long long x){return *this=*this*x;}
  Bignum&amp; operator*=(const Bignum&amp;x){return *this=*this*x;}		
  Bignum operator/(const Bignum &amp;x)const{
    Bignum b=*this,q,tmp;q.a.resize(b.a.size());	
    for(int i=int(b.a.size())-int(x.a.size());b&gt;=x;i--,b.clearzero()){
      tmp.a.assign(b.a.begin()+i,b.a.end());				
      int l=0,r=10000-1,m;
      while(l&lt;=r){
        m=(l+r)&gt;&gt;1;
        if(x*m&lt;=tmp)l=m+1;
        else r=m-1;
      }
      for (unsigned int j=0;j&lt;tmp.a.size();j++)b.a[j+i]=0;
      q.a[i]=r;tmp-=x*r;
      for (unsigned int j=0;j&lt;tmp.a.size();j++)b.a[j+i]=tmp.a[j];
    }
    q.clearzero();return q;
  }
  Bignum operator%(const Bignum &amp;x)const{return *this-*this/x*x;}
  Bignum&amp; operator/=(const Bignum &amp;x){return *this=*this/x;}
  Bignum&amp; operator%=(const Bignum &amp;x){return *this=*this%x;}

  Bignum&amp; operator/=(long long x){
    if(x&gt;=10000)return *this/=Bignum(x);
    else{
      for (int i=int(a.size())-1;i&gt;=0;i--){
        int t=a[i]/x;
        if(i)a[i-1]+=(a[i]-t*x)*10000;
        a[i]=t;
      }
      clearzero();
      return *this;
    }
  }
  Bignum operator/(long long x)const{
    if(x&gt;=10000)return *this / Bignum(x);
    else{
      Bignum y=*this;y/=x;return y;
    }
  }
  long long operator%(long long x)const{
    if(x&gt;(1ll&lt;&lt;40))return (*this%Bignum(x)).toint();
    else{
      long long ans=0;
      for (int i=int(a.size())-1;i&gt;=0;i--)ans=(ans*10000+a[i])%x;
      return ans;
    }
  }
  int operator%(int x)const{
    return int(operator%((long long)x));
  }
  Bignum&amp; operator%=(long long x){
    if(x&gt;(1ll&lt;&lt;40))return *this%=Bignum(x);
    else return *this=*this%x;
  }
  int to2(int *s)const{
    int tot=0;
    vector&lt;unsigned long long&gt;t;
    for (unsigned int i=0;i&lt;a.size();i++)t.push_back((unsigned long long)a[i]);
    while(!t.empty()){
      for (int i=int(t.size())-1;i&gt;=0;i--){
        unsigned long long r=t[i]&gt;&gt;32;
        if(i==0){
          s[tot++]=int(t[i]&amp;0xffffffff);
        }else{
          t[i-1]+=(t[i]&amp;((unsigned long long)0xffffffff))*10000;
        }
        t[i]=r;
      }
      while(!t.empty() &amp;&amp; t.back()==0)t.pop_back();
    }
    return tot;
  }
  bool input(){
    char c;vector&lt;int&gt; s;a.clear();
    while(((c=getchar())&lt;&#x27;0&#x27; || c&gt;&#x27;9&#x27;) &amp;&amp; c!=EOF);
    if(c==EOF){a.push_back(0);return 0;}
    s.push_back(c-&#x27;0&#x27;);
    while((c=getchar())&gt;=&#x27;0&#x27;&amp;&amp;c&lt;=&#x27;9&#x27;)s.push_back(c-&#x27;0&#x27;);          
    int l=s.size();
    for (int i=l-1;i-3&gt;=0;i-=4)a.push_back(s[i]+s[i-1]*10+s[i-2]*100+s[i-3]*1000);
    if(l&amp;3){
      int tmp=0;
      for (int i=0;i&lt;(l&amp;3);i++)tmp=tmp*10+s[i];
      a.push_back(tmp);
    }
    clearzero();
    return 1;
  }
  void output()const{
    for (int i=int(a.size())-1;i&gt;=0;i--)
      if(i==int(a.size())-1)printf(&quot;%d&quot;,a[i]);
      else printf(&quot;%04d&quot;,a[i]);
  }
  void outputln()const{
    output();putchar(&#x27;\n&#x27;);
  }
  friend Bignum max(const Bignum &amp;a,const Bignum &amp;b){return a&gt;b?a:b;}
  friend Bignum min(const Bignum &amp;a,const Bignum &amp;b){return a&lt;b?a:b;}
};

Bignum a, b;

int main(){
  a.input(); b.input();
  (a*b).outputln();
}
</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a class="nav-link" href="/blogs/index.html"> 博客 </a>
<a href="http://www.iis7.com" id="75615d40d87e42318fc1dd15b5a71be5" style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;" target="_blank" class="75615d40d87e42318fc1dd15b5a71be5" >iis7站长之家</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">8.317 ms</td><td class="col-xs-2" style="vertical-align:middle">436 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 100</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 8.317255
mem_kb = 436
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:12:41 | Loaded in 1 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
